Quantifier elimination: Optimal solution for two classical examples
نویسندگان
چکیده
منابع مشابه
Quantifier Elimination: Optimal Solution for Two Classical Examples
The aim of this paper is to give optimal solutions for two classical quantifier elimination problems. These solutions are not obtained by existing general algorithms. However, the design of etlicient algorithms must be oriented towards the production of simple solutions, and not just any odd solution. I do not know of any general algorithm whose solution has similar complexity; it would be inte...
متن کاملCounter-examples to quantifier elimination for fewnomial and exponential expressions
We construct a family of semialgebraic sets of bounded fewnomial complexity, with unbounded fewnomial complexity of their projections to a subspace. This implies impossibility of fewnomial quantifier elimination. We also construct a set defined by exponential algebraic functions such that its projection cannot be defined by a quantifierfree formula with exponential algebraic functions, even if ...
متن کاملQuantifier Elimination for Quartics
Concerning quartics, two particular quantifier elimination (QE) problems of historical interests and practical values are studied. We solve the problems by the theory of complete discrimination systems and negative root discriminant sequences for polynomials that provide a method for real (positive/negative) and complex root classification for polynomials. The equivalent quantifier-free formula...
متن کاملQuantifier Elimination
Quantifier elimination (QE) is a very powerful procedure for problems involving firstorder formulas over real fields. The cylindrical algebraic decomposition (CAD) is a technique for the “efficient” im plementation of QE, that effectively reduces an seemingly infinite problem into a finite (but potentially large) instance. For much more information about QE and CAD (including a reprint of Tar...
متن کاملQuantifier Elimination for Linear Arithmetic
This article formalizes quantifier elimination procedures for dense linear orders, linear real arithmetic and Presburger arithmetic. In each case both a DNF-based non-elementary algorithm and one or more (doubly) exponential NNF-based algorithms are formalized, including the well-known algorithms by Ferrante and Rackoff and by Cooper. The NNF-based algorithms for dense linear orders are new but...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 1988
ISSN: 0747-7171
DOI: 10.1016/s0747-7171(88)80015-4